Cobounding odd cycle colorings
نویسندگان
چکیده
منابع مشابه
Cobounding Odd Cycle Colorings
We give a very short self-contained combinatorial proof of the Babson-Kozlov conjecture, by presenting a cochain whose coboundary is the desired power of the characteristic class.
متن کاملVertex colorings of graphs without short odd cycles
Motivated by the work of Nešetřil and Rödl on “Partitions of vertices”, we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and order that is polynomial in m such that every r-coloring of the vertices of H yields a monochromatic...
متن کاملColorings of odd or even chirality on hexagonal lattices
We define two classes of colorings that have odd or even chirality on hexagonal lattices. This parity is an invariant in the dynamics of all loops, and explains why standard Monte Carlo algorithms are nonergodic. We argue that adding the motion of “stranded” loops allows for parity changes. By implementing this algorithm, we show that the even and odd classes have the same entropy. In general, ...
متن کاملThe Biased Odd Cycle Game
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph G. We prove that for every δ > 0 and large enough n, there exists a constant k for which if δ(G) ≥ δn and χ(G) ≥ k, then Maker can build an odd cycle in the (1 : b) game for b = O ( n log n ) . We also consider the analogous game where Maker and Breaker claim vertices instead of edges. This is a special...
متن کاملMonochromatic Cycle Partitions in Local Edge Colorings
An edge colouring of a graph is said to be an r-local colouring if the edges incident to any vertex are coloured with at most r colours. Generalising a result of Bessy–Thomassé and others, we prove that the vertex set of any 2-locally coloured complete graph may be partitioned into two disjoint monochromatic cycles of different colours. Moreover, for any natural number r, we show that the verte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Research Announcements of the American Mathematical Society
سال: 2006
ISSN: 1079-6762
DOI: 10.1090/s1079-6762-06-00161-2